Inconsistency-Tolerant Instance Checking in Tractable Description Logics
نویسنده
چکیده
Research on inconsistency-tolerant query answering usually assumes that the terminological knowledge is correct, and only the facts (ABox) need to be repaired. In this paper we study the problem of answering instance queries over inconsistent ontologies, by repairing the whole knowledge base (KB). Contrary to ABox repairs, when KB repairs are considered, instance checking in DL-LiteHorn w.r.t. the brave semantics remains tractable, and the intersection semantics allow for an any-time algorithm. We also show that inconsistency-tolerant instance checking w.r.t. ABox repairs is intractable even if only polynomially many ABox repairs exist.
منابع مشابه
On the Complexity of Dealing with Inconsistency in Description Logic Ontologies
We study the problem of dealing with inconsistency in Description Logic (DL) ontologies. We consider inconsistency-tolerant semantics recently proposed in the literature, called AR-semantics and CARsemantics, which are based on repairing (i.e., modifying) in a minimal way the extensional knowledge (ABox) while keeping the intensional knowledge (TBox) untouched. We study instance checking and co...
متن کاملConsistent Query Answering over Description Logic Ontologies
Description Logics (DLs) have been widely used in the last years as formal language for specifying ontologies. In several contexts, as ontology-based data integration, it may frequently happen that data contradict the intensional knowledge provided by the ontology through which they are accessed, which therefore may result inconsistent. In this paper, we analyze the problem of consistent query ...
متن کاملTractable Interval Temporal Propositional and Description Logics
We design a tractable Horn fragment of the Halpern-Shoham temporal logic and extend it to interval-based temporal description logics, instance checking in which is P-complete for both combined and data complexity.
متن کاملComplexity of Inconsistency-Tolerant Query Answering in Datalog+/-
The study of inconsistency-tolerant semantics for query answering in ontological languages has recently gained much attention. In this work, we consider three inconsistency-tolerant semantics recently proposed in the literature, namely: consistent query answering, the intersection (also called IAR) semantics, and the intersection of closed repairs (ICR) semantics. We study the data complexity o...
متن کاملLightweight Description Logics with Meta-modelling
In order to incorporate meta-modelling in Description Logic, we add equations between individuals and concepts. We naturally require that the individual and the concept are semantically equal and the interpretation domain should be a well-founded set. In this paper, we consider the Description Logics behind the three OWL 2 profiles extended with meta-modelling and study the problems of checking...
متن کامل